Ranking Alternatives Offline Bachelor ’ s thesis
نویسندگان
چکیده
Rank aggregation describes how one can derive a consensus from multiple preferences over a given set of alternatives. Alternatives could be candidates in an election, search results ranked by search engines or businesses which are ranked by users with services like Yelp3. There are different paradigms for how the consensus should be constructed. In this thesis we will concern ourselves with the well known Kemeny and Slater rules and the FLAP4 rule. As it is NP-hard to compute the consensus with these paradigms there has been much research on producing good heuristics to decrease computation time. We will introduce and evaluate different heuristics for the different paradigms. www.yelp.com Feedback Linear Arrangement Problem
منابع مشابه
Large-scale Computation of Distributional Similarities for Queries
We present a large-scale, data-driven approach to computing distributional similarity scores for queries. We contrast this to recent webbased techniques which either require the offline computation of complete phrase vectors, or an expensive on-line interaction with a search engine interface. Independent of the computational advantages of our approach, we show empirically that our technique is ...
متن کاملA Quadratic Programming Method for Ranking Alternatives Based on Multiplicative and Fuzzy Preference Relations
This paper proposes a quadratic programming method (QPM) for ranking alternatives based on multiplicative preference relations (MPRs) and fuzzy preference relations (FPRs). The proposed QPM can be used for deriving a ranking from either a MPR or a FPR, or a group of MPRs, or a group of FPRs, or their mixtures. The proposed approach is tested and examined with two numerical examples, and compara...
متن کاملRanking methods based on valued preference relations: A characterization of the net flow method1
This paper deals with the problem of ranking several alternatives on the basis of a valued preference relation. A system of three independent axioms is shown to characterize a ranking method based on "net flows" which contains as particular cases the rules of Copeland and Borda and is used in one of the PROMETHEE methods. IIntroduction Suppose that you want to compare a number of alternatives t...
متن کامل